The Manhattan Effect 1

نویسندگان

  • Chin Ming Hui
  • Eli J. Finkel
  • Gráinne M. Fitzsimons
  • Madoka Kumashiro
  • Wilhelm Hofmann
چکیده

Research on close relationships has frequently contrasted one’s own interests with the interests of the partner or the relationship, and has tended to view the partner’s and the relationship’s interests as inherently aligned. The present article demonstrated that relationship commitment typically causes people to support their partner’s personal interests, but that this effect gets weaker to the extent that those interests misalign or even threaten the relationship. Studies 1a and 1b showed that (a) despite their strong correlation, partner-oriented and relationship-oriented concerns in goal-directed behaviors are separable; and (b) relationship commitment strengthens only the link between relationship-oriented motivation and the goal pursuit (not the link between partner-oriented motivation and the goal pursuit). The remaining seven studies zero in on circumstances in which the partner’s and the relationship’s interests are in conflict, demonstrating that (c) relationship commitment reliably increases the tendency to support the partner’s personal interests when those interests do not pose a strong threat to the relationship, but that (d) this effect becomes weaker—and even reverses direction—as the relationship threat posed by the partner’s interests becomes stronger. The reduction or reversal of the positive link between relationship commitment and pro-partner behaviors in such situations is termed the Manhattan effect. These findings suggest that the partner-versus-relationship conflicts provide fertile ground for novel theorizing and empirical investigations and that relationship commitment appears to be less of a partner-promoting construct than relationship science has suggested; instead, its role appears to be focused on promoting the interests of the relationship. Abstract Word Count: 249Word Count: 249

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An approach to rank efficient DMUs in DEA based on combining Manhattan and infinity norms

In many applications, discrimination among decision making units (DMUs) is a problematic technical task procedure to decision makers in data envelopment analysis (DEA). The DEA models unable to discriminate between extremely efficient DMUs. Hence, there is a growing interest in improving discrimination power in DEA yet. The aim of this paper is ranking extreme efficient DMUs in DEA based on exp...

متن کامل

Estimation of Wirelength Reduction for λ-Geometry vs. Manhattan Placement and Routing∗

λ-geometry routing has recently received much attention due to the potential for reduced interconnect length in comparison to today’s prevalent Manhattan routing. An accurate cost-benefit analysis of λ-geometry routing is impossible without good estimation of the wirelength reduction expected when switching from Manhattan to λ-geometry routing. However, in the literature, estimates of wirelengt...

متن کامل

The Minimum Manhattan Network Problem: A Fast Factor-3 Approximation

Given a set of nodes in the plane and a constant t ≥ 1, a Euclidean t-spanner is a network in which, for any pair of nodes, the ratio of the network distance and the Euclidean distance of the two nodes is at most t. Such networks have applications in transportation or communication network design and have been studied extensively. In this paper we study 1-spanners under the Manhattan (or L1-) m...

متن کامل

The minimum Manhattan network problem: Approximations and exact solutions

Given a set of points in the plane and a constant t ≥ 1, a Euclidean t-spanner is a network in which, for any pair of points, the ratio of the network distance and the Euclidean distance of the two points is at most t. Such networks have applications in transportation or communication network design and have been studied extensively. In this paper we study 1-spanners under the Manhattan (or L1-...

متن کامل

Approximating Minimum Manhattan Networks

Given a set S of n points in the plane, we deene a Manhattan Network on S as a rectilinear network G with the property that for every pair of points in S, the network G contains the shortest rectilinear path between them. A Minimum Manhattan Network on S is a Manhattan network of minimum possible length. A Manhattan network can be thought of as a graph G = (V; E), where the vertex set V corresp...

متن کامل

Manhattan Channel Routing is NP-complete Under Truly Restricted Settings

Settling an open problem that is over ten years old, we show that Abstract-1 Manhattan channel routing—with doglegs allowed—is NP-complete when all nets have two terminals. This result fills the gap left by Szymanski [Szy85], who showed the NP-completeness for nets with four terminals. Answering a question posed by Schmalenbach [Sch90] and Greenberg, Jájá, and Krishnamurty [GJK92], we prove tha...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014